A GENERAL NON-PROBABlLISTIC THEORY OF INDUCTIVE REASONING
نویسنده
چکیده
منابع مشابه
Inductive and Coinductive Session Types in Higher-Order Concurrent Programs
We develop a theory of inductive and coinductive session types in a computational interpretation of linear logic, enabling the representation of potentially infinite interactions in a compositionally sound way that preserves logical soundness, a major stepping stone towards a full dependent type theory for expressing and reasoning about session-based concurrent higher order distributed programs...
متن کاملWell-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
Approximation theory is a fixpoint theory of general (monotone and non-monotone) operators which generalizes all main semantics of logic programming, default logic and autoepistemic logic. In this paper, we study inductive constructions using operators and show their confluence to the well-founded fixpoint of the operator. This result is one argument for the thesis that Approximation theory is ...
متن کاملNonmonotonic Inductive Logic Programming
Nonmonotonic logic programming (NMLP) and inductive logic programming (ILP) are two important extensions of logic programming. The former aims at representing incomplete knowledge and reasoning with commonsense, while the latter targets the problem of inductive construction of a general theory from examples and background knowledge. NMLP and ILP thus have seemingly different motivations and goa...
متن کاملTowards a Teaching Approach for Improving Mathematics Inductive Reasoning Problem Solving
The study aimed at proposing and assessing a training program that integrates both inductive reasoning problem solving and the development of mathematical concepts. This approach was developed on the basis of a general theory of inductive reasoning, which delineates six related classes of problems and the corresponding solution processes and it was implemented to sixth grade students. Data were...
متن کاملA defeasible reasoning model of inductive concept learning from examples and communication
This paper introduces a logical model of inductive generalization, and specifically of the machine learning task of inductive concept learning (ICL). We argue that some inductive processes, like ICL, can be seen as a form of defeasible reasoning. We define a consequence relation characterizing which hypotheses can be induced from given sets of examples, and study its properties, showing they co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011